Dynamic programming algorithms for picture comparison
نویسندگان
چکیده
منابع مشابه
Dynamic Programming Algorithms for Protein Structure Comparison
Bioinformatics is the computer-assisted data management field that assists in gathering, analysing, and representing biological information. A brief history of bioinformatics is that it arose after computerized protein and DNA sequencing started from the 1970s onward and after computers started to be used as central sources, which took place in the midto late 1980s. Bioinformatics widely uses m...
متن کاملDynamic programming algorithms for restriction map comparison
For most sequence comparison problems there is a corresponding map comparison algorithm. While map data may appear to be incompatible with dynamic programming, we show in this paper that the rigor and efficiency of dynamic programming algorithms carry over to the map comparison algorithms. We present algorithms for restriction map comparison that deal with two types of map errors: (i) closely s...
متن کاملDynamic Programming Algorithms
The setting is as follows. We wish to find a solution to a given problem which optimizes some quantity Q of interest; for example, we might wish to maximize profit or minimize cost. The algorithm works by generalizing the original problem. More specifically, it works by creating an array of related but simpler problems, and then finding the optimal value of Q for each of these problems; we calc...
متن کاملStaging Dynamic Programming Algorithms
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering and operations research problems. At a high level, DP algorithms are specified as a system of recursive equations implemented using memoization. The recursive nature of these equations suggests that they can be written naturally in a functional language. However, the requirement for memoization pos...
متن کاملLocal minimization algorithms for dynamic programming equations
The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible controls. This minimization is often performed by comparison over a finite number of elements of the control set. In this paper we demonstrate the importance of an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1985
ISSN: 0196-8858
DOI: 10.1016/0196-8858(85)90007-7